<title>太空电梯</title><link href="http://hzoi.com/tomorrow.css" rel="stylesheet"><div class="ui existing segment"><pre><code><span class="pl-cp">#include</span><span class="pl-cpf">&lt;bits/stdc++.h&gt;</span><span class="pl-cp"></span>
<span class="pl-k">using</span> <span class="pl-k">namespace</span> <span class="pl-n">std</span><span class="pl-p">;</span>
<span class="pl-k">struct</span> <span class="pl-n">material</span><span class="pl-p">{</span>
	<span class="pl-kt">int</span> <span class="pl-n">h</span><span class="pl-p">,</span><span class="pl-n">limit</span><span class="pl-p">,</span><span class="pl-n">num</span><span class="pl-p">;</span>
<span class="pl-p">};</span>
<span class="pl-kt">bool</span> <span class="pl-nf">cmp</span><span class="pl-p">(</span><span class="pl-n">material</span> <span class="pl-n">a</span><span class="pl-p">,</span><span class="pl-n">material</span> <span class="pl-n">b</span><span class="pl-p">){</span>
	<span class="pl-k">return</span> <span class="pl-n">a</span><span class="pl-p">.</span><span class="pl-n">limit</span><span class="pl-o">&lt;</span><span class="pl-n">b</span><span class="pl-p">.</span><span class="pl-n">limit</span><span class="pl-p">;</span>
<span class="pl-p">}</span>
<span class="pl-n">material</span> <span class="pl-n">all</span><span class="pl-p">[</span><span class="pl-mi">500</span><span class="pl-p">];</span>
<span class="pl-kt">int</span> <span class="pl-n">f</span><span class="pl-p">[</span><span class="pl-mi">9999999</span><span class="pl-p">];</span>
<span class="pl-kt">void</span> <span class="pl-nf">solve</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">k</span><span class="pl-p">,</span><span class="pl-kt">int</span> <span class="pl-n">maxlim</span><span class="pl-p">,</span><span class="pl-kt">int</span> <span class="pl-n">minlim</span><span class="pl-p">){</span>
	<span class="pl-k">for</span> <span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">&lt;=</span><span class="pl-n">k</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">){</span>
		<span class="pl-kt">int</span> <span class="pl-n">tot</span><span class="pl-o">=</span><span class="pl-mi">0</span><span class="pl-p">;</span>
		<span class="pl-k">for</span> <span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">j</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">;</span><span class="pl-n">tot</span><span class="pl-o">+</span><span class="pl-n">j</span><span class="pl-o">&lt;=</span><span class="pl-n">all</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">].</span><span class="pl-n">num</span><span class="pl-o">&amp;&amp;</span><span class="pl-n">j</span><span class="pl-o">*</span><span class="pl-n">all</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">].</span><span class="pl-n">h</span><span class="pl-o">&lt;=</span><span class="pl-n">all</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">].</span><span class="pl-n">limit</span><span class="pl-p">;</span><span class="pl-n">j</span><span class="pl-o">&lt;&lt;=</span><span class="pl-mi">1</span><span class="pl-p">){</span>
			<span class="pl-n">tot</span><span class="pl-o">+=</span><span class="pl-n">j</span><span class="pl-p">;</span>
			<span class="pl-k">for</span> <span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">l</span><span class="pl-o">=</span><span class="pl-n">all</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">].</span><span class="pl-n">limit</span> <span class="pl-p">;</span> <span class="pl-n">l</span><span class="pl-o">&gt;=</span><span class="pl-n">j</span><span class="pl-o">*</span><span class="pl-n">all</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">].</span><span class="pl-n">h</span> <span class="pl-p">;</span> <span class="pl-n">l</span><span class="pl-o">--</span><span class="pl-p">)</span>
				<span class="pl-n">f</span><span class="pl-p">[</span><span class="pl-n">l</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-n">max</span><span class="pl-p">(</span><span class="pl-n">f</span><span class="pl-p">[</span><span class="pl-n">l</span><span class="pl-p">],</span><span class="pl-n">f</span><span class="pl-p">[</span><span class="pl-n">l</span><span class="pl-o">-</span><span class="pl-n">j</span><span class="pl-o">*</span><span class="pl-n">all</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">].</span><span class="pl-n">h</span><span class="pl-p">]</span><span class="pl-o">+</span><span class="pl-n">j</span><span class="pl-o">*</span><span class="pl-n">all</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">].</span><span class="pl-n">h</span><span class="pl-p">);</span>
		<span class="pl-p">}</span>
		<span class="pl-kt">int</span> <span class="pl-n">x</span><span class="pl-o">=</span><span class="pl-n">all</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">].</span><span class="pl-n">num</span><span class="pl-o">-</span><span class="pl-n">tot</span><span class="pl-p">;</span>
		<span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">x</span><span class="pl-p">){</span>
			<span class="pl-k">for</span> <span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">j</span><span class="pl-o">=</span><span class="pl-n">all</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">].</span><span class="pl-n">limit</span> <span class="pl-p">;</span> <span class="pl-n">j</span><span class="pl-o">&gt;=</span><span class="pl-n">x</span><span class="pl-o">*</span><span class="pl-n">all</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">].</span><span class="pl-n">h</span> <span class="pl-p">;</span> <span class="pl-n">j</span><span class="pl-o">--</span><span class="pl-p">)</span>
				<span class="pl-n">f</span><span class="pl-p">[</span><span class="pl-n">j</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-n">max</span><span class="pl-p">(</span><span class="pl-n">f</span><span class="pl-p">[</span><span class="pl-n">j</span><span class="pl-p">],</span><span class="pl-n">f</span><span class="pl-p">[</span><span class="pl-n">j</span><span class="pl-o">-</span><span class="pl-n">x</span><span class="pl-o">*</span><span class="pl-n">all</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">].</span><span class="pl-n">h</span><span class="pl-p">]</span><span class="pl-o">+</span><span class="pl-n">x</span><span class="pl-o">*</span><span class="pl-n">all</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">].</span><span class="pl-n">h</span><span class="pl-p">);</span>
		<span class="pl-p">}</span>	
	<span class="pl-p">}</span>
	<span class="pl-kt">int</span> <span class="pl-n">ans</span><span class="pl-o">=-</span><span class="pl-mi">1</span><span class="pl-p">;</span>
	<span class="pl-k">for</span> <span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-n">minlim</span> <span class="pl-p">;</span>  <span class="pl-n">i</span><span class="pl-o">&lt;=</span><span class="pl-n">maxlim</span> <span class="pl-p">;</span> <span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">)</span>
		<span class="pl-n">ans</span><span class="pl-o">=</span><span class="pl-n">max</span><span class="pl-p">(</span><span class="pl-n">ans</span><span class="pl-p">,</span><span class="pl-n">f</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]);</span>
	<span class="pl-n">cout</span><span class="pl-o">&lt;&lt;</span><span class="pl-n">ans</span><span class="pl-p">;</span>
<span class="pl-p">}</span>
<span class="pl-kt">int</span> <span class="pl-nf">main</span><span class="pl-p">(){</span>
	<span class="pl-n">freopen</span><span class="pl-p">(</span><span class="pl-s">&quot;space.in&quot;</span><span class="pl-p">,</span><span class="pl-s">&quot;r&quot;</span><span class="pl-p">,</span><span class="pl-n">stdin</span><span class="pl-p">);</span>
	<span class="pl-n">freopen</span><span class="pl-p">(</span><span class="pl-s">&quot;space.out&quot;</span><span class="pl-p">,</span><span class="pl-s">&quot;w&quot;</span><span class="pl-p">,</span><span class="pl-n">stdout</span><span class="pl-p">);</span>
	<span class="pl-kt">int</span> <span class="pl-n">k</span><span class="pl-p">;</span>
	<span class="pl-n">cin</span><span class="pl-o">&gt;&gt;</span><span class="pl-n">k</span><span class="pl-p">;</span>
	<span class="pl-kt">int</span> <span class="pl-n">maxlim</span><span class="pl-o">=-</span><span class="pl-mi">1</span><span class="pl-p">,</span><span class="pl-n">minlim</span><span class="pl-o">=</span><span class="pl-mi">40005</span><span class="pl-p">;</span>
	<span class="pl-k">for</span> <span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">&lt;=</span><span class="pl-n">k</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">){</span>
		<span class="pl-n">cin</span><span class="pl-o">&gt;&gt;</span><span class="pl-n">all</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">].</span><span class="pl-n">h</span><span class="pl-o">&gt;&gt;</span><span class="pl-n">all</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">].</span><span class="pl-n">limit</span><span class="pl-o">&gt;&gt;</span><span class="pl-n">all</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">].</span><span class="pl-n">num</span><span class="pl-p">;</span>
		<span class="pl-n">maxlim</span><span class="pl-o">=</span><span class="pl-n">max</span><span class="pl-p">(</span><span class="pl-n">maxlim</span><span class="pl-p">,</span><span class="pl-n">all</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">].</span><span class="pl-n">limit</span><span class="pl-p">);</span>
		<span class="pl-n">minlim</span><span class="pl-o">=</span><span class="pl-n">min</span><span class="pl-p">(</span><span class="pl-n">minlim</span><span class="pl-p">,</span><span class="pl-n">all</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">].</span><span class="pl-n">limit</span><span class="pl-p">);</span>
	<span class="pl-p">}</span>
	<span class="pl-n">sort</span><span class="pl-p">(</span><span class="pl-n">all</span><span class="pl-o">+</span><span class="pl-mi">1</span><span class="pl-p">,</span><span class="pl-n">all</span><span class="pl-o">+</span><span class="pl-mi">1</span><span class="pl-o">+</span><span class="pl-n">k</span><span class="pl-p">,</span><span class="pl-n">cmp</span><span class="pl-p">);</span>
	<span class="pl-n">solve</span><span class="pl-p">(</span><span class="pl-n">k</span><span class="pl-p">,</span><span class="pl-n">maxlim</span><span class="pl-p">,</span><span class="pl-n">minlim</span><span class="pl-p">);</span>
	<span class="pl-k">return</span> <span class="pl-mi">0</span><span class="pl-p">;</span>
<span class="pl-p">}</span>
</cpde></pre></div>